Logical theory of the additive monoid of subsets of natural integers

We consider the logical theory of the monoid of subsets of N endowed solely with addition lifted to sets: no other set theoretical predicate or function, no constant (contrarily to previous work by Jeż and Okhotin cited below). We prove that the class of true Σ5 formulas is undecidable and that the whole theory is recursively isomorphic to second-order arithmetic. Also, each ultimately periodic set A (viewed as a predicate X = A) is Π4 definable and their collection is Σ6. Though these undecidability results are not surprising, they involve technical difficulties witnessed by the following facts: 1) no elementary predicate or operation on sets (inclusion, union, intersection, complementation, adjunction of 0) is definable, 2) The class of subsemigroups is not definable though that of submonoids is easily definable. To get our results, we code integers by a Π3 definable class of submonoids and arithmetic operations on N by ∆5 operations on this class.